Restricted Walks in Regular Trees
نویسندگان
چکیده
Let T be the Cayley graph of a finitely generated free group F . Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must follow a number of predetermined steps. We give formulas for the number of such walks by expressing the problem in terms of equations in F and solving the corresponding equations.
منابع مشابه
Infinite Excursions of Router Walks on Regular Trees
A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a deterministic process: at each step it chooses the next unused rotor in its current location, and uses it to jump to the neighboring vertex to which it points. Rotor...
متن کاملRandom Walks on Regular Languages and Algebraic Systems of Generating Functions
A random walk on a regular language is a Markov chain on the set of all finite words from a finite alphabet A whose transition probabilities obey the following rules: (1) Only the last two letters of a word may be modified in one jump, and at most one letter may be adjoined or deleted. (2) Probabilities of modification, deletion, and/or adjunction depend only on the last two letters of the curr...
متن کاملRandom walks in random environment on trees and multiplicative chaos 1
We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random environment. A related problem, with only one type of vertices and quite stringent conditions on the transition probabilities but on general trees has been conside...
متن کاملSpanning Trees in Regular Graphs
Let X be a regular graph with degree k 2 3 and order n. Then the number of spanning trees of X is where yk, ck and (3,,k(l/k) are positive constants, and p, is the number of equivalence classes of certain closed walks of length i in X. The value (k-l)k-l Ck = (k2_2k)"i/2)-l is shown to be the best possible in the sense that K(x~)"" +c^ for some increasing sequence X,, X2,.. . of regular graphs ...
متن کاملOn the Cover Time of Random Walks on Graphs
This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound of O(n 2) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of s log n) for the expected cover time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006